On Limited versus Polynomial Nondeterminism
نویسندگان
چکیده
In this paper, we show that efficient algorithms for some problems Abstract-1 that require limited nondeterminism imply the subexponential simulation of nondeterministic computation by deterministic computation. In particular, if cliques of size O(logn) can be found in polynomial time, then nondeterministic time f(n) is contained in deterministic time 2O( √ f(n) polylog f(n)).
منابع مشابه
What is Cook's theorem?
In this paper, we make a preliminary interpretation of Cook’s theorem presented in [1]. This interpretation reveals cognitive biases in the proof of Cook’s theorem that arise from the attempt of constructing a formula in CNF to represent a computation of a nondeterministic Turing machine. Such cognitive biases are due to the lack of understanding about the essence of nondeterminism, and lead to...
متن کاملComputation Power of Randomization and Nondeterminism
The fundamental questions of computation theory are related to the relative power of determinism, nondeterminism, and randomization. The famous P vs. NP problem is not the only one of main interest. The class of practically solvable algorithmic problems is not specified by deterministic polynomial time (P) anymore, but by bounded-error polynomial time algorithms. Hence, the comparison of the ef...
متن کاملA Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and quasilinear nondeterminism. We show that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and linear nondeterminism.
متن کاملLinear-Nondeterminism Linear Advice for the P-Selective Sets
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and quasilinear nondeterminism. We extend this by showing that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and linear nondeterminism.
متن کاملOn the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism
Branching Programs (BPs) are a well-established computation and representation model for Boolean functions. Although exponential lower bounds for restricted BPs such as Read-Once Branching Programs (BP1s) have been known for a long time, the proof of lower bounds for important selected functions is sometimes difficult. Especially the complexity of fundamental functions such as integer multiplic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Chicago J. Theor. Comput. Sci.
دوره 1997 شماره
صفحات -
تاریخ انتشار 1997